Bin Packing Problem: A Linear Constantspace 3/2 - Approximation Algorithm
نویسندگان
چکیده
منابع مشابه
Bin Packing Problem: a Linear Constant- Space -approximation Algorithm
Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algorithms have been suggested for it. It has been proven that the best algorithm for BPP has the approximation ratio of and the time order of ( ), unless = . In the current paper, a linear approximation algorithm is presented. The suggested algorithm not only has the best possible theoretical factor...
متن کاملBin Packing Problem: A Linear Constant-Space 3/2-Approximation Algorithm
Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algorithms have been suggested for it. It has been proven that the best algorithm for BPP has the approximation ratio of 3 2 and the time order of O(n), unless P = NP. In the current paper, a linear 3 2 -approximation algorithm is presented. The suggested algorithm not only has the best possible theo...
متن کاملLinear time-approximation algorithms for bin packing
Simchi-Levi (Naval Res. Logist. 41 (1994) 579–585) proved that the famous bin packing algorithms FF and BF have an absolute worst-case ratio of no more than 4 , and FFD and BFD have an absolute worst-case ratio of 3 2 , respectively. These algorithms run in time O(n log n). In this paper, we provide a linear time constant space (number of bins kept during the execution of the algorithm is const...
متن کاملBin Packing Problem: Two Approximation Algorithms
The Bin Packing Problem is one of the most important optimization problems. In recent years, due to its NP-hard nature, several approximation algorithms have been presented. It is proved that the best algorithm for the Bin Packing Problem has the approximation ratio 3/2 and the time orderO(n), unlessP=NP. In this paper, first, a -approximation algorithm is presented, then a modification to FFD ...
متن کاملApproximation Algorithm for Extensible Bin Packing
3 Creating an FPTAAS 6 3.1 Step1: Rounding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.2 Step 2: Redefining the prolem . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.3 Step 3: Weakening . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.4 Step 4a: Solving . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.5 Step 4b: ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Computational Science & Applications
سال: 2015
ISSN: 2200-0011
DOI: 10.5121/ijcsa.2015.5601